Iterative Turbo Decoder Analysis Based on Gaussian Density Evolution

نویسندگان

  • Dariush Divsalar
  • Sam Dolinar
چکیده

nels was computed. Wiberg [3] in his dissertation has W e model the density of extrinsic information in iterative turbo decoders by Gaussian density functions. This model is verified by experimental measurements. We consider evolution of these density functions through the iterative turbo decoder as a nonlinear dynamical system with feedback. Iterative decoding of turbo codes and of serially concatenated codes are analyzed based on this method. Many mysteries of turbo codes can be explained based on this analysis. For example we can explain why certain codes converge better with iterative decoding than more powerful codes which are only suitable for max imum likelihood decoding. The roles of systematic bits and of recursive convolutional codes as constituents of turbo codes are explained based on this analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative turbo decoder analysis based on density evolution

We track the density of extrinsic information in iterative turbo decoders by actual density evolution, and also approximate it by consistent Gaussian density functions. The approximate model is verified by experimental measurements. We view the evolution of these density functions through an iterative decoder as a nonlinear dynamical system with feedback. Iterative decoding of turbo codes and o...

متن کامل

Analyzing the turbo decoder using the Gaussian approximation

In this paper, we introduce a simple technique for analyzing the iterative decoder that is broadly applicable to different classes of codes defined over graphs in certain fading as well as additive white Gaussian noise (AWGN) channels. The technique is based on the observation that the extrinsic information from constituent maximum a posteriori (MAP) decoders is well approximated by Gaussian ra...

متن کامل

A Dynamical System View for the Turbo Decoding Algorithm Based on the Gaussian Approximation

The Gaussian approximation has been used to study iterative decoding algorithms of graph-based codes like turbo codes [7, 8] and low-density parity check (LDPC) codes [6]. In this work, the Gaussian approximation is used to describe the turbo decoding algorithm (TDA) as an elegant discrete dynamical system and explicit iterative equations for the evolution of the BER with the decoder phases of ...

متن کامل

Iterative PDF Estimation and Turbo-Decoding Scheme for DS-CDMA Systems with Non-Gaussian Global Noise

In some multiuser direct-sequence code-division multiple-access (DS-CDMA) systems, the commonly used Gaussian approximation (GA) is inaccurate to describe the probability density function (PDF) of the global noise, which is the sum of the multiple-access interference (MAI) and channel noise. This inaccuracy causes the performance degradation of turbo codes as compared to decoders based on the t...

متن کامل

Iterative Decoding for the Davey-MacKay Construction over IDS-AWGN Channel

Turbo equalization is an iterative equalization and decoding technique that can achieve impressive performance gains for communication systems. In this letter, we investigate the turbo equalization method for the decoding of the Davey-MacKay (DM) construction over the IDSAWGN channels, which indicates a cascaded insertion, deletion, substitution (IDS) channel and an additive white Gaussian nois...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000